Перевод: со всех языков на английский

с английского на все языки

trivial machine

См. также в других словарях:

  • Machine that always halts — In computability theory, a machine that always halts also called a decider (Sipser, 1996) or a total Turing machine (Kozen, 1997) is a Turing machine that halts for every input. Because it always halts, the machine is able to decide whether a… …   Wikipedia

  • Machine epsilon — In floating point arithmetic, the machine epsilon (also called macheps, machine precision or unit roundoff) is, for a particular floating point unit, the difference between 1 and the smallest exactly representable number greater than one. It… …   Wikipedia

  • Boltzmann machine — A Boltzmann machine is the name given to a type of stochastic recurrent neural network by Geoffrey Hinton and Terry Sejnowski. Boltzmann machines can be seen as the stochastic, generative counterpart of Hopfield nets. They were one of the first… …   Wikipedia

  • Doubly-fed electric machine — Doubly fed electric machines (i.e., electric motors or electric generators) belong to a category of electric machines that incorporate two multiphase winding sets of similar power rating that have independent means of excitation. As a result,… …   Wikipedia

  • Doubly fed electric machine — Doubly fed electric machines are electric motors or electric generators that have windings on both stationary and rotating parts, where both windings transfer significant power between shaft and electrical system. Doubly fed machines are useful… …   Wikipedia

  • Universal Turing machine — This article is a supplement to the article Turing machine. Alan Turing s universal computing machine (alternately universal machine , machine U , U ) is the name given by him (1936 1937) to his model of an all purpose a machine (computing… …   Wikipedia

  • X-machine — The X machine ( XM ) is a theoretical model of computation introduced by Samuel Eilenberg in 1974.S. Eilenberg (1974) Automata, Languages and Machines, Vol. A . Academic Press, London.] The X in X machine represents the fundamental data type on… …   Wikipedia

  • Counter machine reference model — The Counter machine s reference model is a set of choices and conventions to be used with the Counter machine and other model variants of the Register machine concept. It permits comparisons between models, and serves a didactic function with… …   Wikipedia

  • Swinging Atwood's machine — The Swinging Atwood s machine (SAM) is a mechanism that resembles a simple Atwood s machine except that one of the masses is allowed to swing in a two dimensional plane.The Hamiltonian for SAM is::H(r, heta) = T + V = frac{1}{2} M {dot r}^2 +… …   Wikipedia

  • Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… …   Wikipedia

  • Rice's theorem — In computer science, Rice s theorem named after Henry Gordon Rice (also known as The Rice Myhill Shapiro theorem after Rice and John Myhill) states that, for any non trivial property of partial functions, there exists at least one algorithm for… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»